lower bound algorithm
英 [ˈləʊə(r) baʊnd ˈælɡərɪðəm]
美 [ˈloʊər baʊnd ˈælɡərɪðəm]
【计】下界算法
双语例句
- Theoretical results of the lower bound of the bit error rate as well as the channel estimation error of the proposed algorithm were given.
从理论上分析了该算法所能达到的信道估计误差下限和比特误码率下限，并提出了最优叠加导频序列的设计准则。 - According to the lower bound, Cubeheap is the near optimal data structure to implement the general B& B algorithm.
得出了立体堆为实现一般分枝界限算法的几乎最优数据结构； - Also given are a lower bound of the worst case asymptotic performance ratio of KC A and analysis of the asymptotic worst case, average case performance ratio of the KC A algorithm when A is NF, FF, BF or WF.
分析了当选用的算法A是著名装箱算法NF，FF，BF，WF时KC-A算法的最坏情况渐近性能比和平均性能比； - Improvement of the lower bound of the on line algorithm for parallel
平行机的实时到达on-line算法下界的改进 - A lower bound which has efficient algorithm is established for one dimension even order modulation systems.
对于一维偶数阶调制系统，本文给出了卷积码的一个有效算法的平方欧氏距离的下界。 - A lower bound of I function of large deviation for Markov chains and convergence of annealing algorithm
马尔可夫链大偏差Ⅰ函数的下界和Annealing算法的收敛性 - In this paper, we present a concrete method& The lower bound algorithm to solve Lp on convex cone, and prove it's convergence and the existence of lower bound element.
针对锥上的线性规划问题的求解，在基线算法理论的基础上，提出并讨论了基线算法的一种具体的实现算法&保界算法，并证明了它的可行性和收敛性。 - A lower bound of I function of large deviation for Markov chains was presented and applied to obtain the conclusion that the rate of convergence in propability for Annealing algorithm has a order of fractional power of number of states.
首先得出马尔可夫链大偏差Ⅰ函数的下界，并利用它得出Annealing算法依概率收敛速度具有状态总数的分数幂阶。 - A hybrid algorithm combined with dynamic programming and the lower bound ( or upper bound) algorithm is proposed. It is on the basis of analysing the depth first search ( DFS) and the breadth first search ( BFS) methods.
本文分析了深度优先搜索方法（DFS）和广度优先搜索（BFS）方法的特点，提出了一种混合使用动态规划方法和下界（上界）算法的精确求解方法求解组合优化问题。 - This paper provides the Cramer-Rao lower bound of alternating separation algorithm.
该文推导了交替分离算法的Cramer-Rao界。 - Three-machine permutation Flow shop problem ( PFSP) is researched here. A lower bound algorithm and an evaluation function to select the next job in solution are proposed.
对三机床置换FlowShop问题（PFSP）进行了研究，得到一种下界算法，提出了一种评价函数用于求解时选择后续工件。 - Some lower bound values are obtained by the algorithm. It is proved that r ( 4,7)> 47.
给出了一个效率较高的算法，该算法已经编程实现，并由此得出了一个具有46点（4,7）循环巧妙图，从而证明了了r（4,7）≥47。 - We prove that this problem is a NP-Complete problem and propose a lower bound evaluated algorithm and two heuristic algorithms. The first approach is a greedy algorithm.
本文证明了此问题是一个NP-Complete问题，提出了一种下限评估算法和两种启发式算法：第一种启发式算法是基于GREED思想的算法； - In addition, this paper shows the tight lower bound ( 2 o ( 1)) lnn ( 1) of the approximation ratio of set cover greedy algorithm for the weighted redundant test set with redundancy n 1.
另外，给出了集合覆盖贪心算法对冗余度为n1的加权冗余测试集问题的近似比的紧密下界（2o（1））lnn（1）。 - Studying the convergence property of finite stored BFGS algorithm, under condition of step size in search with lower bound, the global convergence of algorithm for general convex function is proved.
研究有限内存BFGS算法的收敛性质，在搜索步长一致有下界的条件下对一般凸函数证明了算法的整体收敛性。 - By discussion the Cramer-Rao lower bound of Alternating Separation algorithm, some properties of the signal separation operator matrix are given.
通过对交替分离算法的Cramer-Rao界的讨论，该文还给出了有关矩阵分离算子一些重要的性质。 - From the results of computer simulation, the proposed novel subspace-based estimator has better system performance than Ho algorithm or Lin algorithm, which is very close to the Cramer-Rao lower bound ( CRB).
通过计算机仿真可以得到，提出的新颖算法的估计性能优于Ho算法和Lin算法，且接近于克拉美-罗界（Cramer-RaoLowerBound，CRB）。 - Although it has the high time complexity, the new lower and upper bound method can be used as the second step of the whole algorithm with the increased pruning power.
新的上下界函数的时间复杂度比较高，但由于过滤能力的较大增强，可以作为两步式方法的第二步。 - A lower guaranteed cost function upper bound and jumps and a suboptimal guaranteed cost state feedback controller are obtained by solving the optimization problem. A new algorithm is presented to design an impulsive controller and a feedback controller for a class of impulsive switched singular systems.
求解这个优化问题能够得到较小的保成本函数上界和状态跳变及一个次优的保成本状态反馈控制器。对一类脉冲切换广义系统，提出了脉冲控制器和反馈控制器设计的一个新算法。 - APR algorithm is close to the theoretical lower bound of time. APR algorithm which has high meter reading success rate can run without routing knowledge. It is the strongest algorithm to overcome the time-varying and random interference in all of three algorithms.
APR算法接近理论时间下界，抄表成功率高，无需路由知识，可以从零路由知识开始运行，同时APR算法克服时变性和随机干扰的能力最强。 - It is found that the lower bound is greater than or equal to maintenance bandwidth comsumption of the proposed bandwidth-optimal repair algorithm based on MCR.
本文分析了基于非对称修复机制的修复带宽下界，并发现该下界大于等于已提出的MCR带宽最优算法的带宽消耗。 - The comparison experiments with both lower bound and built-in software show that the proposed model and algorithm are more efficient.
与生产时间理论下界和现场机器自带软件调度方案的对比表明了模型及其算法的有效性。 - The elaborate theoretical analyses prove the upper bound of dynamic programming and no sharing method, and the lower bound of greedy algorithm and dynamic programming.
使用理论分析证明了动态规划与不共享的性能上界，以及贪心算法与动态规划方法的性能下界。